Some Results on Chromaticity of Quasi-Linear Paths and Cycles
نویسنده
چکیده
Let r > 1 be an integer. An h-hypergraph H is said to be r-quasi-linear (linear for r = 1) if any two edges of H intersect in 0 or r vertices. In this paper it is shown that r-quasi-linear paths P h,r m of length m > 1 and cycles C h,r m of length m > 3 are chromatically unique in the set of h-uniform r-quasi-linear hypergraphs provided r > 2 and h > 3r − 1.
منابع مشابه
On the Chromaticity of Multi-Bridge Hypergraphs
A multi-bridge hypergraph is an h-uniform linear hypergraph consisting of some linear paths having common extremities. In this paper it is proved that the multisets of path lengths of two chromatically equivalent multi-bridge hypergraphs are equal provided the multiplicities of path lengths are bounded above by 2h−1 − 2. ∗This research is partially supported by Abdus Salam School of Mathematica...
متن کاملCharacterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملQuasi-Kernels for Oriented Paths and Cycles
If D is a digraph, then K V D is a quasi-kernel of D if D K is discrete and for each y V D K there is x K such that the directed distance from y to x is less than three. We give formulae for the number of quasi-kernels and for the number of minimal quasi-kernels of oriented paths and cycles.
متن کاملPaths and cycles in extended and decomposable digraphs,
We consider digraphs – called extended locally semicomplete digraphs, or extended LSD’s, for short – that can be obtained from locally semicomplete digraphs by substituting independent sets for vertices. We characterize Hamiltonian extended LSD’s as well as extended LSD’s containing Hamiltonian paths. These results as well as some additional ones imply polynomial algorithms for finding a longes...
متن کاملOn the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012